Digraphs with Isomorphic Underlying and Domination Graphs: Pairs of Paths
نویسندگان
چکیده
A domination graph of a digraph D, dom (D), is created using thc vertex set of D and edge uv E E (dom (D)) whenever (u, z) E A (D) or (v, z) E A (D) for any other vertex z E V (D). Here, we consider directed graphs whose underlying graphs are isomorphic to their domination graphs. Specifically, digraphs are completely characterized where UG (D) is the union of two disjoint paths.
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملDigraphs with isomorphic underlying and domination graphs: 4-cycles and pairs of paths
A domination graph of a digraph D, domeD), is created using the vertex set of D, V(D). There is an edge uv in domeD) whenever (u, z) or (v, z) is in the arc set of D, A(D), for every other vertex z E V(D). For only some digraphs D has the structure of domeD) been characterized. Examples of this are tournaments and regular digraphs. The authors have characterizations for the structure of digraph...
متن کاملTwin minus domination in directed graphs
Let $D=(V,A)$ be a finite simple directed graph. A function$f:Vlongrightarrow {-1,0,1}$ is called a twin minus dominatingfunction (TMDF) if $f(N^-[v])ge 1$ and $f(N^+[v])ge 1$ for eachvertex $vin V$. The twin minus domination number of $D$ is$gamma_{-}^*(D)=min{w(f)mid f mbox{ is a TMDF of } D}$. Inthis paper, we initiate the study of twin minus domination numbersin digraphs and present some lo...
متن کاملCharacterization of digraphs with equal domination graphs and underlying graphs
A domination graph of a digraph D, dom(D), is created using the vertex set of D and edge {u, v} ∈ E[dom(D)] whenever (u, z) ∈ A(D) or (v, z) ∈ A(D) for every other vertex z ∈ V (D). The underlying graph of a digraph D, UG(D), is the graph for which D is a biorientation. We completely characterize digraphs whose underlying graphs are identical to their domination graphs, UG(D)= dom(D). The maxim...
متن کاملIncidence dominating numbers of graphs
In this paper, the concept of incidence domination number of graphs is introduced and the incidence dominating set and the incidence domination number of some particular graphs such as paths, cycles, wheels, complete graphs and stars are studied.
متن کامل